/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
string s1[1100], s2[1100];
ll n, m;

int main()
{
    IOS;
    cin >> n >> m;
    for (ll i = 0; i < n; i++)
    {
        cin >> s1[i];
    }
    for (ll i = 0; i < n; i++)
    {
        cin >> s2[i];
    }
    ll sum = 0;
    for (ll i = 0; i < n; i++)
    {
        for (ll j = 0; j < m; j++)
        {
            if (s1[i][j] != s2[i][j])
                sum++;
        }
    }
    if (sum * 2 <= n * m)
    {
        for (ll i = 0; i < n; i++)
        {
            cout << s1[i] << endl;
        }
    }
    else
    {
        for (ll i = 0; i < n; i++)
        {
            for (ll j = 0; j < m; j++)
            {
                if (s1[i][j] == '.')
                    cout << 'X';
                else
                    cout << '.';
            }
            cout << endl;
        }
    }
    getchar();
    getchar();
    return 0;
}
